#include"BSTree-kv.h"

void test_1()
{
	int a[] = { 8,3,1,10,6,4,7,14,13 };
	char b[] = { 'a','b','c','d','e','f','g','h','i'};
	BSTree<int,char> t1;
	for (int i = 0; i < sizeof(a)/sizeof(int); i++)
	{
		t1.Insert(a[i], b[i]);
	}
	t1.InOrder();
	cout << endl;
	t1.Erase(8);
	t1.InOrder();
}


int main()
{
	test_1();


	return 0;
}